github.com/andybalholm/brotli/matchfinder.arrival.length (field)

31 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		bargain1.go#L103: 				length:   uint32(j - m.Start),
		bargain1.go#L120: 			unmatched = int(arrivedHere.length)
		bargain1.go#L132: 				length: uint32(unmatched + 1),
		bargain1.go#L191: 				Length:   int(a.length),
		bargain1.go#L194: 			i -= int(a.length)
		bargain1.go#L199: 			matches[len(matches)-1].Unmatched = int(a.length)
		bargain1.go#L200: 			i -= int(a.length)
		bargain2.go#L114: 				length:   uint32(j - m.Start),
		bargain2.go#L131: 			unmatched = int(arrivedHere.length)
		bargain2.go#L143: 				length: uint32(unmatched + 1),
		bargain2.go#L223: 				Length:   int(a.length),
		bargain2.go#L226: 			i -= int(a.length)
		bargain2.go#L231: 			matches[len(matches)-1].Unmatched = int(a.length)
		bargain2.go#L232: 			i -= int(a.length)
		bargain3.go#L120: 				length:   uint32(j - m.Start),
		bargain3.go#L137: 			unmatched = int(arrivedHere.length)
		bargain3.go#L149: 				length: uint32(unmatched + 1),
		bargain3.go#L249: 				Length:   int(a.length),
		bargain3.go#L252: 			i -= int(a.length)
		bargain3.go#L257: 			matches[len(matches)-1].Unmatched = int(a.length)
		bargain3.go#L258: 			i -= int(a.length)
		pathfinder.go#L58: 	length   uint32
		pathfinder.go#L227: 			unmatched = int(arrivedHere.length)
		pathfinder.go#L239: 				length: uint32(unmatched + 1),
		pathfinder.go#L263: 						length:   uint32(j - m.Start),
		pathfinder.go#L274: 			!(arrivedHere.length != 0 && arrivedHere.distance == uint32(pending.Start-pending.Match)) {
		pathfinder.go#L286: 						length:   uint32(j - i),
		pathfinder.go#L311: 				Length:   int(a.length),
		pathfinder.go#L314: 			i -= int(a.length)
		pathfinder.go#L319: 			matches[len(matches)-1].Unmatched = int(a.length)
		pathfinder.go#L320: 			i -= int(a.length)